Scalable Metropolis Monte Carlo for simulation of hard shapes

نویسندگان

  • Joshua A. Anderson
  • M. Eric Irrgang
  • Sharon C. Glotzer
چکیده

We design and implement HPMC, a scalable hard particle Monte Carlo simulation toolkit, and release it open source as part of HOOMD-blue. HPMC runs in parallel on many CPUs and many GPUs using domain decomposition. We employ BVH trees instead of cell lists on the CPU for fast performance, especially with large particle size disparity, and optimize inner loops with SIMD vector intrinsics on the CPU. Our GPU kernel proposes many trial moves in parallel on a checkerboard and uses a block-level queue to redistribute work among threads and avoid divergence. HPMC supports a wide variety of shape classes, including spheres / disks, unions of spheres, convex polygons, convex spheropolygons, concave polygons, ellipsoids / ellipses, convex polyhedra, convex spheropolyhedra, spheres cut by planes, and concave polyhedra. NVT and NPT ensembles can be run in 2D or 3D triclinic boxes. Additional integration schemes permit Frenkel-Ladd free energy computations and implicit depletant simulations. In a benchmark system of a fluid of 4096 pentagons, HPMC performs 10 million sweeps in 10 minutes on 96 CPU cores on XSEDE Comet. The same simulation would take 7.6 hours in serial. HPMC also scales to large system sizes, and the same benchmark with 16.8 million particles runs in 1.4 hours on 2048 GPUs on OLCF Titan.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Monte Carlo simulation study of vinblastine and vincristine as clinical drugs

In this study, Monte Carlo statistical mechanical simulations for vinblastine and vincristine werecarried out in standard manner using the Metropolis sampling technique in canonical (T, V, N)ensemble., Geometrical optimizations of vinblastine and vincristine were carried out with the HFmethod coupled to 6-31G(d) basis sets for all atoms. Simulation was done by four force fields ofMM+, BIO+, AMB...

متن کامل

Algorithms for Faster and Larger Dynamic Metropolis Simulations

In dynamic Monte Carlo simulations, using for example the Metropolis dynamic, it is often required to simulate for long times and to simulate large systems. We present an overview of advanced algorithms to simulate for longer times and to simulate larger systems. The longer-time algorithm focused on is the Monte Carlo with Absorbing Markov Chains (MCAMC) algorithm. It is applied to metastabilit...

متن کامل

Monte Carlo Dynamically Weighted Importance Sampling For Finite Element Model Updating

The Finite Element Method (FEM) is generally unable to accurately predict natural frequencies and mode shapes of structures (eigenvalues and eigenvectors). Engineers develop numerical methods and a variety of techniques to compensate for this misalignment of modal properties, between experimentally measured data and the computed result from the FEM of structures. In this paper we compare two in...

متن کامل

Metropolis Sampling

Monte Carlo (MC) sampling methods are widely applied in Bayesian inference, system simulation and optimization problems. The Markov Chain Monte Carlo (MCMC) algorithms are a well-known class of MC methods which generate a Markov chain with the desired invariant distribution. In this document, we focus on the Metropolis-Hastings (MH) sampler, which can be considered as the atom of the MCMC techn...

متن کامل

A Shuffled Complex Evolution Metropolis algorithm for optimization and uncertainty assessment of hydrologic model parameters

[1] Markov Chain Monte Carlo (MCMC) methods have become increasingly popular for estimating the posterior probability distribution of parameters in hydrologic models. However, MCMC methods require the a priori definition of a proposal or sampling distribution, which determines the explorative capabilities and efficiency of the sampler and therefore the statistical properties of the Markov Chain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Physics Communications

دوره 204  شماره 

صفحات  -

تاریخ انتشار 2016